Extremal clustering in non-stationary random sequences

نویسندگان

چکیده

Abstract It is well known that the distribution of extreme values strictly stationary sequences differ from those independent and identically distributed in extremal clustering may occur. Here we consider non-stationary but random variables subject to suitable long range dependence restrictions. We find limiting appropriately normalized sample maxima depends on a parameter measures average sequence. Based this new representation derive asymptotic for time between consecutive observations construct moment likelihood based estimators clustering. specialize our results with periodic structure.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to compute the extremal index of stationary random fields

We present local dependence conditions for stationary random fields under which the extremal index and the asymptotic distribution of the maximum M(n1,...,nd) can be calculated from the joint distribution of a finite number s1s2 of variables. keywords: Extremal index, local and long range dependence, random field.

متن کامل

Asymmetric exclusion process and extremal statistics of random sequences.

A mapping is established between sequence alignment, one of the most commonly used tools of computational biology, at a certain choice of scoring parameters and the asymmetric exclusion process, one of the few exactly solvable models of nonequilibrium physics. The statistical significance of sequence alignments is characterized through studying the total hopping current of the discrete time and...

متن کامل

Online Learning of Non-stationary Sequences

We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. The performance of each expert may change over time in a manner unknown to the learner. We formulate a class of universal learning algorithms for this problem by expressing them as simple Bayesian algorithms operating on models analogous to Hidden Markov Models (HMMs). We de...

متن کامل

Bayesian Clustering of Non-stationary Data

Non-stationary data clustering is a hard, ill-posed problem, which is nevertheless unavoidable in several scientific fields. A representative example is the problem of Spike Sorting, which involves clustering spike trains recorded from the brain by a micro-electrode, according to source neuron. It is a complicated problem which requires a lot of human labor, partly due to the non-stationary nat...

متن کامل

Non-stationary Clustering Bayesian Networks for glaucoma

Glaucoma is a major cause of blindness and its mechanisms are not fully understood. The progression of the disease can be slowed by early diagnosis, but this is a difficult task because available data is typically noisy and has high variability. Several artificial intelligence approaches have been used in this context, although they generally don’t exploit the temporal nature of the data. Here ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Extremes

سال: 2021

ISSN: ['1386-1999', '1572-915X']

DOI: https://doi.org/10.1007/s10687-021-00418-2